Erdős-Szemerédi Sunflower conjecture
ثبت نشده
چکیده
I will give two proofs of the Erdős-Szemerédi Sunflower conjecture: a proof that uses the cap-set problem from Alon et al. [1] and a proof from Naslund and Sawin [5] that uses the slice-rank method. I will also show how Naslund and Sawin [5] apply the same ideas in an attempt towards the (stronger, unproved) Erdős-Rado Sunflower conjecture. A brief note on the connection to algorithms for fast matrix multiplication is included at the end.
منابع مشابه
Erdős-szemerédi Problem on Sum Set and Product Set
The basic theme of this paper is the fact that if A is a finite set of integers, then the sum and product sets cannot both be small. A precise formulation of this fact is Conjecture 1 below due to Erdős-Szemerédi [E-S]. (see also [El], [T], and [K-T] for related aspects.) Only much weaker results or very special cases of this conjecture are presently known. One approach consists of assuming the...
متن کاملOn a conjecture of Erdős and Turán for additive basis
An old conjecture of Erdős and Turán states that the representation function of an additive basis of the positive integers can not be bounded. We survey some results related to this still wide open conjecture.
متن کاملThe Cameron–Erdős Conjecture
A subset A of the integers is said to be sum-free if there do not exist elements x, y, z ∈ A with x+y = z. It is shown that the number of sum-free subsets of {1, . . . , N} is O(2N/2), confirming a well-known conjecture of Cameron and Erdős.
متن کاملOn a Question of Erdős and Graham
In this note, we sharpen work of Ulas to provide what is, in some sense, the minimal counterexample to a “conjecture” of Erdős and Graham about square values of products of disjoint blocks of consecutive integers.
متن کاملA Coupling, and the Darling–erdős Conjectures
We derive a new coupling of the running maximum of an Ornstein–Uhlenbeck process and the running maximum of an explicit i.i.d. sequence. We use this coupling to verify a conjecture of Darling and Erdős (1956).
متن کامل